In this paper, we study the minimum cycle base of the planar graphs obtained
from two 2-connected planar graphs by identifying an edge (or a cycle) of one graph with the corresponding edge (or cycle) of another, related with map geometries, i.e., Smarandache 2-dimensional manifolds

Dengju, Ma

Han, Ren

ZENODO

English

A polynomial-time algorithm to find the shortest cycle base of a graph, SIAM.J.Comput.,

Automorphisms groups of Maps, Surfaces and Smarandache geometries,

Generating cycle spaces for graphs on surfaces with small genera,

Graph Theory with Application,

Graphs on Surfaces, Johns Hopkins

Minimum cycle bases of Halin graphs,

Minimum cycle bases of outerplanar graphs,

Minimum Cycle Bases of Product Graphs,

On the connectivities of tree graphs,

Planar tree-width,

Review of ring perception algorithms for chemical graph,

Short cycle structures for graphs on surfaces and an open problem of Mohar and Thomassen, Science in China: Series A math.,

Union of all the minimum cycle bases of a graph,

Minimum Cycle Base of Graphs Identified by Two Planar Graphs